Computation of the Class Number and Class Group of a Complex Cubic Field

نویسنده

  • H. C. Williams
چکیده

Let h and G be, respectively, the class number and the class group of a complex cubic field of discriminant A. A method is described which makes use of recent ideas of Lenstra and Schoof to develop fast algorithms for finding h and G. Under certain Riemann hypotheses it is shown that these algorithms will compute h in 0(|A|1/5 + E) elementary operations and G in 0(|A|l/4 + F) elementary operations. Finally, the results of running some 3^ computer programs to determine h and G for all pure cubic fieldsâ(vD ), with 2 ^ D < 30,000, are summarized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the tenacity of cycle permutation graph

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

متن کامل

On the Computation of a Table of Complex Cubic Fields with Discriminant D > -106

A method for finding all the nonisomorphic complex cubic fields with discriminant D > -10 is described. Three different methods were used to find the class number of each of these fields. The speed of these techniques is discussed and several tables illustrating the computational results are presented. These include tables of the distribution of the fields and the class numbers and the class gr...

متن کامل

A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

متن کامل

On rational groups with Sylow 2-subgroups of nilpotency class at most 2

A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.

متن کامل

ADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF NONLINEAR SYSTEMS WITH UNKNOWN DISTRIBUTED TIME-VARYING DELAYS AND UNKNOWN CONTROL DIRECTIONS

In this paper, an adaptive fuzzy control scheme is proposed for a class of perturbed strict-feedback nonlinear systems with unknown discrete and distributed time-varying delays, and the proposed design method does not require a priori knowledge of the signs of the control gains.Based on the backstepping technique, the adaptive fuzzy controller is constructed. The main contributions of the paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010